DEFISIENSI SISI-AJAIB SUPER DARI GRAF KIPAS
نویسندگان
چکیده
منابع مشابه
Path-kipas Ramsey numbers
For two given graphs F and H, the Ramsey number R(F,H) is the smallest positive integer p such that for every graph G on p vertices the following holds: either G contains F as a subgraph or the complement of G contains H as a subgraph. In this paper, we study the Ramsey numbers R(Pn, K̂m), where Pn is a path on n vertices and K̂m is the graph obtained from the join of K1 and Pm. We determine the ...
متن کاملPersian, Dari and Tajik in Central Asia
Individual researchers retain the copyright on their work products derived from research funded through a contract or grant from the National Council for Eurasian and East European Research (NCEEER). However, the NCEEER and the United States Government have the right to duplicate and disseminate, in written and electronic form, reports submitted to NCEEER to fulfill Contract or Grant Agreements...
متن کاملDiscriminating Similar Languages: Persian and Dari
Although widely-studied in recent years, Language Identification (LID) systems for determining the language of input texts often fail to discriminate between similar languages like Croatian-Serbian and Malay-Indonesian. This has brought attention to the task of discriminating similar languages, varieties and dialects – including a recent shared task [3]. Persian (also known as Farsi) and Dari (...
متن کاملLAF/GrAF-grounded Representation of Dependency Structures
This paper shows that a LAF/GrAF-based annotation schema can be used for the adequate representation of syntactic dependency structures in many languages. We first argue that there are at least two types of textual units that can be annotated with dependency information: words/tokens and chunks/phrases. Based on this consideration, we discuss a sub-typing of GrAF to represent the corresponding ...
متن کاملAnatomy of Annotation Schemes: Mapping to GrAF
In this paper, we apply the annotation scheme design methodology defined in (Bunt, 2010) and demonstrate its use for generating a mapping from an existing annotation scheme to a representation in GrAF format. The most important features of this methodology are (1) the distinction of the abstract and concrete syntax of an annotation language; (2) the specification of a formal semantics for the a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal Matematika UNAND
سال: 2013
ISSN: 2721-9410,2303-291X
DOI: 10.25077/jmu.2.3.121-125.2013